Optimization of Polynomial Functions

نویسندگان

  • M. Marshall
  • M. MARSHALL
چکیده

Recently progress has been made in the development of algorithms for optimizing polynomials. The main idea being stressed is that of reducing the problem to an easier problem involving semidefinite programming [18]. It seems that in many cases the method dramatically outperforms other existing methods. The idea traces back to work of Shor [16][17] and is further developed by Parrilo [10] and by Parrilo and Sturmfels [11] and by Lasserre [7][8].

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A method to obtain the best uniform polynomial approximation for the family of rational function

In this article, by using Chebyshev’s polynomials and Chebyshev’s expansion, we obtain the best uniform polynomial approximation out of P2n to a class of rational functions of the form (ax2+c)-1 on any non symmetric interval [d,e]. Using the obtained approximation, we provide the best uniform polynomial approximation to a class of rational functions of the form (ax2+bx+c)-1 for both cases b2-4a...

متن کامل

Global optimization of mixed-integer polynomial programming problems: A new method based on Grobner Bases theory

Mixed-integer polynomial programming (MIPP) problems are one class of mixed-integer nonlinear programming (MINLP) problems where objective function and constraints are restricted to the polynomial functions. Although the MINLP problem is NP-hard, in special cases such as MIPP problems, an efficient algorithm can be extended to solve it. In this research, we propose an algorit...

متن کامل

Sufficient Conditions for a New Class of Polynomial Analytic Functions of Reciprocal Order alpha

In this paper, we consider a new class of analytic functions in the unit disk using polynomials of order alpha. We give some sufficient conditions for functions belonging to this class.

متن کامل

Tutte polynomials of wheels via generating functions

We find an explicit expression of the Tutte polynomial of an $n$-fan. We also find a formula of the Tutte polynomial of an $n$-wheel in terms of the Tutte polynomial of $n$-fans. Finally, we give an alternative expression of the Tutte polynomial of an $n$-wheel and then prove the explicit formula for the Tutte polynomial of an $n$-wheel.

متن کامل

Bending and Free Vibration Analysis of Functionally Graded Plates via Optimized Non-polynomial Higher Order Theories

Optimization concept in the context of shear deformation theories was born for the development of accurate models to study the bending problem of structures. The present study seeks to extend such an approach to the dynamic analysis of plates. A compact and unified formulation with non-polynomial shear strain shape functions (SSSFs) is employed to develop a static and free vibration analysis of...

متن کامل

Coupled systems of equations with entire and polynomial functions

We consider the coupled system$F(x,y)=G(x,y)=0$,where$$F(x, y)=bs 0 {m_1}   A_k(y)x^{m_1-k}mbox{ and } G(x, y)=bs 0 {m_2} B_k(y)x^{m_2-k}$$with entire functions $A_k(y), B_k(y)$.We    derive a priory estimates  for the sums of the rootsof the considered system andfor the counting function of  roots.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003